The Lindenbaum construction and decidability.

construction and validation of the translation teacher competency test and the scale of students’ perceptions of translation teachers

the major purpose of this study was to develop the translation teacher competency test (ttct) and examine its construct and predictive validity. the present study was conducted in two phases: a qualitative phase as well as a quantitative phase. in the first phase of the study, the author attempted to find out the major areas of competency required for an academic translation teacher. the second...

Lindenbaum Algebras and Partial Conservativity

A partial Lindenbaum algebra TA, where A is a theory extending Peano arithmetic and T G {LTn,£n}, is the full Lindenbaum algebra for A restricted to sentences in A provably equivalent to rn-sentences. Using a new result on pairs of partially conservative sentences, we show that Tl£ and E^ are not isomorphic.

Forcing with Propositional Lindenbaum Algebras

We prove equivalence between the forcing with propositional Lindenbaum algebras and the Cohen forcing with finite partial functions.

Decidability and Tameness in the Theory of Finite Semigroups

Büchi, Lindenbaum, Tarski: A Program Analysis Appetizer

One can prove that a program satisfies a correctness property in different ways. The deductive approach uses logic and is automated using decision procedures and proof assistants. The automata-theoretic approach reduces questions about programs to algorithmic questions about automata. In the abstract interpretation approach, programs and their properties are expressed in terms of fixed points i...